A coalgebraic view on decorated traces
نویسندگان
چکیده
F. Bonchi, M. Bonsangue, 2,3 G. Caltais, 3,4 J. Rutten, 3,5 A. Silva, 3,5,6 1 ENS Lyon, Université de Lyon, LIP (UMR 5668 CNRS ENS Lyon UCBL INRIA) 2 LIACS Leiden University, The Netherlands 3 Centrum voor Wiskunde en Informatica, The Netherlands 4 School of Computer Science Reykjavik University, Iceland 5 Radboud University Nijmegen, The Netherlands 6 HASLab / INESC TEC, Universidade do Minho, Braga, Portugal
منابع مشابه
Final Semantics for Decorated Traces
In concurrency theory, various semantic equivalences on labelled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors [13], we give a c...
متن کاملGeneric Trace Logics
We combine previous work on coalgebraic logic with the coalgebraic traces semantics of Hasuo, Jacobs, and Sokolova.
متن کاملTraces, Executions and Schedulers, Coalgebraically
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from executions, by projecting away states. These traces and executions are sequences and will be called “thin”. The coalgebraic approach gives rise to both “thin” and “fat” traces/executions, where in the “fat” case the struc...
متن کاملFrom Coalgebraic to Monoidal Traces
The main result of this paper shows how coalgebraic traces, in suitable Kleisli categories, give rise to traced monoidal structure in those Kleisli categories, with finite coproducts as monoidal structure. At the heart of the matter lie partially additive monads inducing partially additive structure in their Kleisli categories. By applying the standard “Int” construction one obtains compact clo...
متن کاملMaximal traces and path-based coalgebraic temporal logics
This paper gives a general coalgebraic account of temporal logics whose semantics involves a notion of computation path. Examples of such logics include the logic CTL* for transition systems and the logic PCTL for probabilistic transition systems. Our path-based temporal logics are interpreted over coalgebras of endofunctors obtained as the composition of a computation type (e.g. nondeterminist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 26 شماره
صفحات -
تاریخ انتشار 2016